A Verifiable Symmetric Searchable Encryption Scheme Based on the AVL Tree

Abstract Verifiable symmetric searchable encryption is a keyword search technology that supports verification of results. Many schemes improve performance by dividing each label into segments and storing them in Trie-tree at the expense high storage. And index will degenerate linear linked list when all labels have same prefix except for last segment. But it greatly affect efficiency. In this paper, we propose verifiable scheme based on AVL Tree (abbreviated as VSSE-AVL), which uses complete to build index. Compared with index, VSSE-AVL not only balances storage performance, but also avoids degradation. To verify correctness completeness empty results, store path information leaf node one child node. Considering substitution attack, bind file identifier so client find out once server returns inconsistent Rigorous security analysis shows satisfies privacy verifiability. SSE-2 security, experimental evaluation our proposed performs better storage, verification.